Matrix Multiplication II
نویسنده
چکیده
These notes started their life as a lecture given at the Toronto Student Seminar on February 9, 2012. The material is taken mostly from the classic paper by Coppersmith and Winograd [CW]. Other sources are §15.7 of Algebraic Complexity Theory [ACT], Stothers’s thesis [Sto], V. Williams’s recent paper [Wil], and the paper by Cohn at al. [CKSU]. Starred sections are the ones we didn’t have time to cover.
منابع مشابه
A New Parallel Matrix Multiplication Method Adapted on Fibonacci Hypercube Structure
The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...
متن کاملAlgebraic adjoint of the polynomials-polynomial matrix multiplication
This paper deals with a result concerning the algebraic dual of the linear mapping defined by the multiplication of polynomial vectors by a given polynomial matrix over a commutative field
متن کاملThe geometry of rank decompositions of matrix multiplication II: 3×3 matrices
This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. In this paper we: establish general facts about rank decompositions of tensors, describe potential ways to search for new matrix multiplication decompositions, give a geometric proof of the theorem of [3] establishing the symmetry group of Strassen’s algorithm, and present two particularly nice s...
متن کاملOn Sparse Matrix-Vector Multiplication with FPGA-Based System
In this paper we report on our experimentation with the use of FPGA-based system to solve the irregular computation problem of evaluating when the matrix A is sparse. The main features of our matrix-vector multiplication algorithm are (i) an organization of the operations to suit the FPGA-based system ability in processing a stream of data, and (ii) the use of distributed arithmetic technique t...
متن کاملThe geometry of rank decompositions of matrix multiplication II: $3\times 3$ matrices
This is the second in a series of papers on rank decompositions of the matrix multiplication tensor. We present new rank $23$ decompositions for the $3\times 3$ matrix multiplication tensor $M_{\langle 3\rangle}$. All our decompositions have symmetry groups that include the standard cyclic permutation of factors but otherwise exhibit a range of behavior. One of them has 11 cubes as summands and...
متن کاملSubquadratic Multiplication Using Optimal Normal Bases
Based on a recently proposed Toeplitz matrix-vector product approach, a subquadratic computational complexity scheme is presented for multiplications in binary extended finite fields using Type I and II optimal normal bases.
متن کامل